Performance Analysis of Accumulator-Based Revocation Mechanisms
نویسندگان
چکیده
Anonymous credentials are discussed as a privacy friendlier replacement for public key certificates. While such a transition would help to protect the privacy of digital citizens in the emerging information society, the wide scale deployment of anonymous credentials still poses many challenges. One of the open technical issues is the efficient revocation of anonymous credentials. Currently, accumulator based revocation is considered to be the most efficient and most privacy friendly mechanism for revoking anonymous credentials. This paper analyses the performance of three accumulator based credential revocation schemes. It identifies the bottlenecks of those implementations and presents guidelines to improve the efficiency in concrete applications.
منابع مشابه
Accumulators and U-Prove Revocation
This work introduces the most efficient universal accumulator known today. For the first time, we have an accumulator which does not depend on hidden order groups, does not require any exponentiations in the target group associated with the pairing function, and only requires two pairings to verify a proof-of-knowledge of a witness. We present implementations of our accumulator and another rece...
متن کاملAccumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and Group Membership Revocation
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constructing an identitybased (ID-based) ring signature scheme with constant-size signatures and its interactive counterpart, and providing membership revocation to group signature, traceable signature and identity escrow sc...
متن کاملEfficient Revocation of Anonymous Group Membership Certificates and Anonymous Credentials
An accumulator scheme, introduced be Benaloh and de Mare [BdM94] and further studied by Barić and Pfitzmann [BP97], is an algorithm that allows to hash a large set of inputs into one short value, called the accumulator, such that there is a short witness that a given input was incorporated into the accumulator. We put forward the notion of dynamic accumulators, i.e., a method that allows to dyn...
متن کاملAn Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
The success of electronic authentication systems, be it eID card systems or Internet authentication systems such as CardSpace, highly depends on the provided level of user-privacy. Thereby, an important requirement is an efficient means for revocation of the authentication credentials. In this paper we consider the problem of revocation for certificate-based privacy-protecting authentication sy...
متن کاملAnalysis of bilinear pairing-based accumulator for identity escrowing
An accumulator based on bilinear pairings was proposed at CT-RSA’05. In this paper, we first demonstrate that the security model proposed by Lan Nguyen does lead to a cryptographic accumulator which is not collision resistant. Second we show that we can provide collision-resistance by updating the adversary model appropriately. Finally, we propose an improvement on Nguyen’s identity escrow sche...
متن کامل